Distinct Distances in Homogeneous Sets in Euclidean Space

On distinct distances in homogeneous sets in the Euclidean space

It is shown that a homogeneous set of n points in the d-dimensional Euclidean space determines at least Ω(n2d/(d 2+1)/ log n) distinct distances for a constant c(d) > 0. In three-space, the above general bound is slightly improved and it is shown that a homogeneous set of n points determines at least Ω(n.6091) distinct distances.

Distinct distances in high dimensional homogeneous sets

We show that the number of distinct distances in a well-distributed set of n points in R is Ω(n2/d−1/d2) which is not far from the best known upper bound O(n). For the special case d = 3, we have a further improvement Ω(n).

On Contiguous Congruent Sets in Euclidean Space

biaccessibility in quadratic julia sets

در این رساله برای چندجمله ای های درجه ی دوم با مجموعه ی ژولیای همبند موضعی; ثابت خواهیم کرد: اندازه برولین مجموعه نقاط از دو سو دست یافتنی در چندجمله ای های درجه دو برابر با صفر است مگر چندجمله ای چبی شف که برابر با یک است. و برای چندجمله ای های درجه دوم با نقاط ثابت خنثی غیر گویا ثابت خواهیم کرد: 1)هر نقطه ی از دو سو دست یافتنی در حالت زیگل نهایتا به نقطه ی بحرانی و در حالت کرمر به نقطه ث...

Complex networks in the Euclidean space of communicability distances.

We study the properties of complex networks embedded in a Euclidean space of communicability distances. The communicability distance between two nodes is defined as the difference between the weighted sum of walks self-returning to the nodes and the weighted sum of walks going from one node to the other. We give some indications that the communicability distance identifies the least crowded rou...